More on “Connected (n, m)-graphs with minimum and maximum zeroth-order general Randić index”
نویسندگان
چکیده
منابع مشابه
A note on the zeroth-order general randić index of cacti and polyomino chains
The present note is devoted to establish some extremal results for the zeroth-order general Randi'{c} index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.
متن کاملSufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کاملa note on the zeroth-order general randić index of cacti and polyomino chains
the present note is devoted to establish some extremal results for the zeroth-order general randi'{c} index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.
متن کامل2-Connected graphs with minimum general sum-connectivity index
The general sum-connectivity index of a graph G is χα(G) = ∑ uv∈E(G) (d(u)+d(v)), where d(u) denotes the degree of vertex u ∈ V (G), and α is a real number. In this paper, we show that in the class of graphs G of order n ≥ 3 and minimum degree δ(G) ≥ 2, the unique graph G having minimum χα(G) is K2 + Kn−2 if −1 ≤ α < α0 ≈ −0.867. Similarly, if we impose the supplementary condition for G to be t...
متن کاملsufficient conditions on the zeroth-order general randic index for maximally edge-connected digraphs
let $d$ be a digraph with vertex set $v(d)$. for vertex $vin v(d)$, the degree of $v$,denoted by $d(v)$, is defined as the minimum value if its out-degree and its in-degree.now let $d$ be a digraph with minimum degree $deltage 1$ and edge-connectivity$lambda$. if $alpha$ is real number, then the zeroth-order general randic index is definedby $sum_{xin v(d)}(d(x))^{alpha}$. a digraph is maximall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.02.014